Parallel coordinate order for <scp>high‐dimensional</scp> data
نویسندگان
چکیده
Visualization of high-dimensional data is counter-intuitive using conventional graphs. Parallel coordinates are proposed as an alternative to explore multivariate more effectively. However, it difficult extract relevant information through the parallel when with thousands overlapping lines. The order axes determines perception on coordinates. Thus, between attributes remains hidden if improperly ordered. Here we propose a general framework reorder This enough cover wide range visualization objectives. It also flexible contain many ordering measures. Consequently, present coordinate binary optimization problem and enhance achieve computationally efficient greedy approach that suits data. Our applied wine genetic purpose dimension reordering highlight attributes' dependence. Genetic reordered cluster detection. shows able adapt criteria for objective.
منابع مشابه
COORDINATE INFLUENCE ON SINGULARITY OF A 3-UPS PARALLEL MANIPULATOR
This paper shows the coordinates influence on singularity of a three degree-of-freedom structure, namely, three-Universal-Prismatic-Spherical (3-UPS) parallel manipulator. Rotational coordinates, which are chosen to define the orientation of the platform, affect the singularity of the manipulator. Euler parameters, which don't have any inherent geometrical singularity are utilized, however they...
متن کاملParallel Coordinate Descent Methods for Big Data Optimization
In this work we show that randomized (block) coordinate descent methods can be accelerated by parallelization when applied to the problem of minimizing the sum of a partially separable smooth convex function and a simple separable convex function. The theoretical speedup, as compared to the serial method, and referring to the number of iterations needed to approximately solve the problem with h...
متن کاملExploring uncertainty in remotely sensed data with parallel coordinate plots
The existence of uncertainty in classified remotely sensed data necessitates the application of enhanced techniques for identifying and visualizing the various degrees of uncertainty. This paper, therefore, applies the multidimensional graphical data analysis technique of parallel coordinate plots (PCP) to visualize the uncertainty in Landsat Thematic Mapper (TM) data classified by the Maximum ...
متن کاملFeature Clustering for Accelerating Parallel Coordinate Descent
Large-scale `1-regularized loss minimization problems arise in high-dimensional applications such as compressed sensing and high-dimensional supervised learning, including classification and regression problems. High-performance algorithms and implementations are critical to efficiently solving these problems. Building upon previous work on coordinate descent algorithms for `1-regularized probl...
متن کاملAsynchronous Parallel Coordinate Minimization for MAP Inference
Finding the maximum a-posteriori (MAP) assignment is a central task for structured prediction. Since modern applications give rise to very large structured problem instances, there is increasing need for efficient solvers. In this work we propose to improve the efficiency of coordinate-minimization-based dual-decomposition solvers by running their updates asynchronously in parallel. In this cas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistical Analysis and Data Mining
سال: 2021
ISSN: ['1932-1864', '1932-1872']
DOI: https://doi.org/10.1002/sam.11543